منابع مشابه
The Maximum-Mean Subtree
In this paper, we define the Maximum-Mean Subtree problem on trees, an equivalent reformulation of the Fractional Prize-Collecting Steiner Tree Problem on Trees. We describe an algorithm that solves the Maximum-Mean Subtree problem, and prove that our algorithm runs in O(n) time in the worst case, improving a previous O(n log n) algorithm. 1 The Maximum-Mean Subtree Problem Given a rooted tree ...
متن کاملThe Weighted Maximum-Mean Subtree and Other Bicriterion Subtree Problems
We consider problems in which we are given a rooted tree as input, and must find a subtree with the same root, optimizing some objective function of the nodes in the subtree. When this function is the sum of constant node weights, the problem is trivially solved in linear time. When the objective is the sum of weights that are linear functions of a parameter, we show how to list all optima for ...
متن کاملThe average order of a subtree of a tree
Article history: Received 17 March 2008 Available online 11 June 2009
متن کاملSubtree filament graphs are subtree overlap graphs
We show that the class of intersection graphs of subtree filaments in a tree is identical to the class of overlap graphs of subtrees in a tree.
متن کاملThe DNR Order: What Does it Mean?
As medical science continues to advance, patients nowadays with progressive cardiopulmonary diseases live to older ages. However, they too will eventually reach their unsustainable physiological limit and many die in poor health and discomfort prior to their demise. Regrettably many physicians have not kept pace in dealing with the inevitable end-of- life issues, along with modern technological...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2018
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22434